COMMENT ⊗   VALID 00006 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	\init{
C00003 00003	\appnxbegin{Appendix One}
C00014 00004
C00020 00005
C00028 00006
C00036 ENDMK
C⊗;
\init{
\input cmpdes
\input temacs
\def\draft{T}
\titlepage
\newpage
\setcount0 255
\parttitle{TEIRESIAS: APPLICATIONS OF META-LEVEL KNOWLEDGE}
}
\baselineskip 12pt
\appnxbegin{Appendix One}
\appnxnumber{1}
\appnxtitle{REFERENCES}
\rjustline{\:A References}
\vskip 13pc

Several abbreviations are used for readability:

\listbegin
\hddlistentry[{\rm 3IJCAI}]{{\sl Proceedings of the Third International Joint
Conference on Artificial Intelligence}, [available from SRI International,
Publications, 330 Ravenswood Ave, Menlo Park, CA 94025].}

\hddlistentry[{\rm 4IJCAI}]{{\sl Proceedings of the Fourth International Joint Conference
on Artificial Intelligence}, [available from MIT A.I. Lab, 545 Technology
Square, Cambridge, MA 02138].}

\hddlistentry[{\rm AIM {$\#$}}]{A.\ I.\ Memo {$\#$}, Computer Science Department,
Stanford, California.}

\hddlistentry[{\rm MIT}]{Massachusetts Institute of Technology, Cambridge, MA.}

\hddlistentry[{\rm CMU}]{Carnegie Mellon University, Pittsburgh, Pennsylvania.}
\listend


\startrefs

\reference
Aristotle, {\sl Rhetoric}, J. H. Freese (trans.),  G. P. Putnam, New York,
1926.  [Aristotle26]

\reference
Bachman, C. W., Trends in data base management--1975,
{\sl National Computer Conference}, 1975, pp. 569-576.  [Bachman75]

\reference
Balzer, R. M., Dataless programming, {\sl Proc. AFIPS Conf.}, 1967, pp. 535-544.
[Balzer67]

\reference
Barrow, H. G., and J. M. Tannenbaum, Representation and use of knowledge in vision,
{\sl SIGART Newsletter},  June 1975, pp. 2-8.  (Also see the articles following it.)
[Barrow75]

\reference
Baumgart, B. G., Geometric models for computer vision, AIM 249, October 1974.
[Baumgart74]

\reference
Bobrow, D. N.,
Natural language input for a computer problem solving system, in M. Minsky
(Ed.), {\sl Semantic Information Processing}, The MIT Press, MIT, 1968,
pp. 146-226.
[Bobrow68]

\reference
Bobrow, D. N., and A. Collins (Eds.),
{\sl Representation and Understanding}, Academic Press, New York, 1975.
[Bobrow75]

\reference
Bobrow, D. N., and T. Winograd,
Overview of KRL, {\sl Cognitive Science}, vol. 1, January 1977, pp. 3-47.
[Bobrow77]

\reference
Brachman, R. J.,
Structural knowledge in a document information consulting system,
TR 6-75, Center for Research in Computing Technology, Harvard University,
Cambridge, 1975.
[Brachman75]

\reference
Brown, J. S.,
Uses of AI and advanced computer technology in education,
Bolt, Beranek, & Newman, Cambridge, December 1975.
[Brown75]

\reference
Brown, J. S., and R. R. Burton,
Diagnostic models for procedural bugs in mathematical skills,
{\sl Cognitive Science}, volume 2, April-June 1978, pp. 155-192.
[Brown78]

\reference
Buchanan, B. G., and J. Lederberg,
The heuristic {\sc DENDRAL} program for explaining empirical data,
{\sl IFIP}, 1971, pp. 179-188.
[Buchanan71]

\reference
Buchanan, B. G.,  E. A. Feigenbaum, and N. S. Sridharan,
Heuristic theory formation:  Data interpretation and rule formation,
in B. Meltzer and D. Michie (Eds.),
{\sl Machine Intelligence 7}, Edinburgh University Press, Edinburgh, 1972,
pp. 267-292. 
[Buchanan72]

\reference
Buchanan, B. G. and T. Mitchell,
Model-directed learning of production rules,
in {\sl Pattern-Directed Inference Systems}, (Waterman and Hayes-Roth, eds.),
pp 297-312, Academic Press, NY, 1978.
[Buchanan78]

\reference
Carbonell, J. R., and A. M. Collins,
Natural semantics in AI,
{\sl 3IJCAI}, 1973, pp. 344-351.
[Carbonell73]

\reference
Carroll, L.,
Alice's Adventures in Wonderland, in M. Gardner (Ed.), {\sl The Annotated
Alice}, World Publishing Company, 1960.
[Carroll60]

\reference
Dahl, O. J., B. Myhrhaug, and K. Nygaard,
Common base language, {\sl Norwegian Computing Center Technical Report},
1970.
[Dahl70]

\reference
Davis, R., and J. King,
An overview of production systems, in E. W. Elcock and D. Michie (Eds.),
{\sl Machine Intelligence 8}, John Wiley & Sons, New York, 1977  
(also AIM 271).
[Davis77a]

\reference
Davis, R., B. G. Buchanan, and E. Shortliffe,
Production rules as a representation for a knowledge-based consultation
program,
{\sl Artificial Intelligence}, vol. 8, no. 1, February 1977, pp. 15-45
(also AIM 266).
[Davis77b] 

\reference
Dijkstra, E., O. J. Dahl, and C. A. R. Hoare,
{\sl Structured Programming}, Academic Press, New York, 1972.
[Dijkstra72]

\reference
Eswaran, K. P., and D. D. Chamberlain,
Functional specification of a subsystem for data base integrity,
{\sl Proceedings of International Conference on Very Large Data Bases},
September 1975.
[Eswaran75]

\reference
Falk, G.,
Computer interpretation of imperfect line data,
AIM 132, August 1970.
[Falk70]

\reference
Faught, W., K. Colby, and R. Parkison,
The interaction of affects, intentions and desires,
AIM 253, December 1974.
[Faught74]

\newpage

\reference
Feigenbaum, E. A., B. Buchanan, and J. Lederberg,
On generality and problem solving, in B. Meltzer and D. Michie (Eds.),
{\sl Machine Intelligence 6}, Edinburgh University Press, Edinburgh, 1971,
pp. 165-190.
[Feigenbaum71]

\reference
Feldman, J., J. R. Low, D. C. Swinehart, and R. H. Taylor,
Recent developments in {\sc SAIL}, an {\sc ALGOL}-based language for artificial intelligence,
AIM 176, November 1972.
[Feldman72]

\reference
Fikes, R. J., and N. J. Nilsson,
{\sc STRIPS}--A new approach to the application of theorem proving to problem solving,
{\sl Artificial Intelligence}, vol. 2, Winter 1971, pp. 189-208.
[Fikes71]

\reference
Fikes R. J., P. E. Hart, and N. J. Nilsson,
Learning and executing generalized robot plans,
{\sl Artificial Intelligence}, vol. 3, Winter 1972, pp. 251-288.
[Fikes72]


\reference
Finkel, R., R. Taylor, R. Bolles, R. Paul, and J. Feldman,
{\sc AL}, a programming system for automation,
AIM 243, June 1975.
[Finkel74]

\reference
Gelernter, H.,
Realization of a geometry-theorem proving machine,
in E. A. Feigenbaum and J. Feldman (Eds.),
{\sl Computers and Thought}, McGraw-Hill, New York, 1963, pp. 134-152.
[Gelernter59]

\reference
Goldstein, I.,
Understanding simple picture programs,
AI-TR-294, MIT, September 1974.
[Goldstein74]

\reference
Green, C. C.,
The application of theorem proving to question answering systems,
AIM 96, August 1969.
[Green69]

\reference
Green, C. C., R. J. Waldinger, D. R. Barstow, R. Elschlager, D. B. Lenat,
B. P. McCune, D. E. Shaw, and L. I. Steinberg,
Progress report on program-understanding systems,
AIM 240, August 1974.
[Green74]

\reference
Gregory, R. L.,  {\sl Eye and Brain}, McGraw-Hill, New York, 1966.
[Gregory66]

\reference
Guzman, A.,
Computer recognition of 3-D objects in a visual scene, MAC-TR-59, MIT,
December 1968.
[Guzman68]

\reference
Hansen, G.,
Adaptive systems for dynamic run-time optimization of programs,
doctoral dissertation, CMU, March 1974.
[Hansen74]

\reference
Harre, R.,
{\sl The Principles of Scientific Thinking},
University of Chicago Press, Chicago, 1970.
[Harre70]

\reference
Hart, P. E.,
Progress on a computer-based consultant, {\sl 4IJCAI}, 1975, pp. 831-841.
[Hart75]

\reference
Hayes-Roth, F., and J. McDermott,
Knowledge acquisition from structural descriptions,
Tech. Rep., Computer Science Department, CMU, February 1976.
[Hayes-Roth76]

\reference
Hewitt, C.,
Procedural semantics--models of procedures and the teaching of procedures,
{\sl Natural Language Processing} (Courant Computer Science Symposium),
vol. 8, 1971, pp. 331-350.
[Hewitt71]

\reference
Hewitt, C.,
Description and theoretical analysis of {\sc PLANNER}, doctoral
dissertation, Department of Mathematics, MIT, 1972.
[Hewitt72]

\reference
Hewitt, C., and B. Smith,
Toward a programmer's apprentice,
{\sl IEEE Transactions on Software Engineering}, SE-1, March 1975, pp. 26-45.
[Hewitt75]

\reference
Howe, W. J.,  Computer-assisted design of complex organic syntheses, 
doctoral dissertation, 
Harvard University, Cambridge, 1973 ({\sl Dissertation Abstracts}, P5207 B, 33/11).
[Howe73]

\reference
Interaction Associates,
{\sl Strategy Notebook},
Interaction Associates, Inc., San Francisco, 1972.
[Interaction72]

\newpage

\reference
Johnson, H. R.,
A schema report facility for a CODASYL-based data definition language,
in B. C. M. Dougue and G. M. Nijssen (Eds.),
{\sl Data Base Description},  American Elsevier, New York, 1975, pp. 299-328.
[Johnson75]

\reference
Kulikowski, C. A., S. Weiss, and A. Saifr,
Glaucoma diagnosis and therapy by computer, {\sl Proceedings of Annual Meeting
of Assoc. for Research in Vision and Opthamology}, May 1973.
[Kulikowski73]

\reference
Learning Research Group,
Personal dynamic media, Xerox PARC, Palo Alto, Calif., 1976.
[Learning76]

\reference
Lesser, V. R., R. D. Fennell, L. D. Erman, and D. R. Reddy,
Organization of the {\sc HEARSAY II} speech understanding system,
{\sl IEEE Transactions on Acoustics, Speech, and Signal Processing},
ASSP-23, February 1975, pp. 11-23.
[Lesser74]

\reference
Liskov, B., and S. Zilles,
Programming with abstract data types,
{\sl SIGPLAN Notices}, April 1974.
[Liskov74]

\reference
Low J.,
Automatic coding:  Choice of data structures,
AIM 242, August 1974.
[Low74]

\reference
Lukasiewicz, J.,
A numerical interpretation of the theory of propositions,
in L. Borkowski (Ed.), {\sl Jan Lukasiewicz:  Selected Works}, 1970.
[Lukasiewisz70]


\reference
The {\sc MACSYMA} reference manual, The MATHLAB Group, MIT, September 1974.
[MACSYMA74]

\reference
Manna, Z.,
Correctness of programs,
{\sl Journal of Computer Systems Sciences}, May 1969.
[Manna69]

\reference
McDermott, D.,
Assimilation of new information, AI-TR-291, MIT, February 1974.
[McDermott74]

\reference
McLeod, D. J.,
High level domain definition in a relational data base system,
{\sl SIGPLAN Notices}, no. 1,  April 1976, pp. 47-57.
[McLeod76]

\reference
Miller, P. B.,
Strategy selection in medical diagnosis,
Project MAC TR-153, MIT, September 1975.
[Miller75]

\reference
Minsky, M. (Ed.),
{\sl Semantic Information Processing},
MIT Press, MIT, 1968.
[Minsky68]

\reference
Minsky, M.,
A framework for representing knowledge,
MIT AI Memo 306, June 1974.
[Minsky74]

\reference
Mitchell, J. G.,
The design and construction of flexible and efficient interactive programming systems,
doctoral dissertation, Department of Computer Science, CMU, June 1970.
[Mitchell70]

\reference
Newell, A., J. C. Shaw, and H. A. Simon,
A variety of intelligent learning in a general problem-solver, in
M. Yovitts and S. Cameron (Eds.), {\sl Self-organizing Systems}, 
Pergamon, New York, pp. 153-189.
[Newell59]

\reference
Newell, A., and H. A. Simon,
{\sc GPS}, a program that simulates human thought, in
 E. A. Feigenbaum and J. Feldman (Eds.), {\sl Computers and Thought}, 
McGraw-Hill, New York, pp. 279-296.
[Newell61]

\reference
Newell, A.,
Heuristic programming; ill-structured problems,
in  Aronofsky (Ed.), {\sl Progress in Operations Research}, vol. 3, 1969, pp.
362-414.
[Newell69]

\reference
Newell, A., and H. Simon,
{\sl Human Problem Solving}, Prentice-Hall, Englewood Cliffs, New Jersey, 1972.
[Newell72]

\reference
Norman, D. A., and D. E. Rumelhart,
{\sl Explorations in Cognition}, W. H. Freeman, San Francisco, 1975.
[Norman75]

\reference
Parnas, D. L.,
On the criteria to be used in decomposing systems into modules,
{\sl CACM}, vol. 15, December 1972, pp. 1053-1058.
[Parnas72]

\newpage

\reference
Parnas, D. L., and D. P. Siewiorek,
Use of the concept of transparency in the design of hierarchically
structured systems,
{\sl CACM}, vol. 18, July 1975, pp. 401-408.
[Parnas75]

\reference
Polya, G.,
{\sl How to Solve It},
McGraw-Hill, Princeton, New Jersey, 1954.
[Polya54]

\reference
Pople, H., J. Meyers, and R. Miller,
{\sc DIALOG}, a model of diagnostic logic for internal medicine,
{\sl 4IJCAI}, 1975,  pp.  848-855.   (The system has since been renamed {\sc INTERNIST}.)
[Pople75]

\reference
Post, E.: Formal reductions of the general combinatorial problem, {\sl American Journal of Math},
vol. 65, 1943, pp. 197-268.
[Post43] For an introduction to the general principles involved, see
M. Minksy, {\sl Computation:  Finite and infinite machines}, Prentice Hall,
Englewood Cliffs, New Jersey, 1967, chap. 12.

\reference
Reddy, R.,
The {\sc HEARSAY} speech understanding system,
{\sl 3IJCAI}, 1973, pp. 185-199.
[Reddy73]

\reference
Reiger, C. J.,
Conceptual memory:  A theory and computer program,
AIM 233, July 1974.
[Reiger74]

\reference
Resier, J. F.,
BAIL - A debugger for SAIL,
AIM 270, October 1975.
[Resier75]

\reference
Roberts, L. G.,
Machine perception of 3-D solids, Tech. Rep. 315, Lincoln Labs, MIT,
May 1963.
[Roberts63]

\reference
Rubin, A. D.,
Hypothesis formation and evaluation in medical diagnosis,
AI-TR-316, MIT, January 1975.
[Rubin75]

\reference
Rulifson, J. F., J. A. Derksen, and R. J. Waldinger,
{\sc QA4}:  A procedural calculus for intuitive reasoning,
Tech. Note 73, SRI International, Palo Alto, Calif., November 1972.
[Rulifson72]

\reference
Rumelhart, D. E., and D. A. Norman,
Active semantic networks as a model of human memory,
{\sl 3IJCAI}, 1973, pp. 450-458.
[Rumelhart73]

\reference
Sacerdoti, E.,
Planning in a hierarchy of abstraction spaces, {\sl 3IJCAI}, 1973, pp. 412-422.
[Sacerdoti73]

\reference
Sacerdoti, E.,
{\sl A Structure for Plans and Behavior},
American Elsevier, New York, 1977.
[Sacerdoti77]

\reference
Samet, H.,
Automatically proving the correctness of translations involving optimized code,
AIM 259, May 1975.
[Samet75]

\reference
Samuel, A. L.,
Some studies in machine learning using the game of checkers II--recent progress,
{\sl IBM Journal of Research and Development}, vol. 11, 1967, pp. 601-617.
[Samuel67]

\reference
Sandewall, E.,
Ideas about managment of {\sc LISP} data bases,
{\sl 4IJCAI}, 1975, pp. 585-592.
[Sandewall75]


\reference
Shaw, D., W. Swartout, and C. Green,
Inferring {\sc LISP} programs from examples,
{\sl 4IJCAI}, 1975,  pp. 260-267.
[Shaw75]

\reference
Shortliffe, E. H., R. Davis, B. G. Buchanan, S. G. Axline, C. C. Green, and
S. N. Cohen,
Computer-based consultations in clinical therapeutics--explanation and rule acquisition
capabilities of the {\sc MYCIN} system,
{\sl Computers and Biomedical Research}, vol. 8, 1975, pp. 303-320.
[Shortliffe75a] 

\reference
Shortliffe, E. H., and B. G. Buchanan,
A model of inexact reasoning in medicine,
{\sl Mathematical Biosciences}, vol. 23, 1975, pp. 351-379.
[Shortliffe75b] 

\reference
Shortliffe, E. H.,
{\sl MYCIN:  Computer-based Medical Consultations}, American Elsevier,
New York, 1976.
[Shortliffe76] 

\reference
Simon, H.,
The structure of ill-structured problems,
{\sl Artificial Intelligence}, vol. 4, 1973, pp.181-201.
[Simon73]

\newpage

\reference
Sophocles,
Oedipus the King (427 B.C.),
in Greene and Lattimore (Eds.),
{\sl Greek Tragedies}, vol. 1,  University of Chicago Press,
Chicago, 1960.
[Sophocles27]

\reference
Spitzen, J., and B. Wegbreit,
The verification and synthesis of data structures,
{\sl Acta Informatica}, vol. 4, 1975, pp. 127-144.
[Spitzen75]

\reference
Stonebreaker, M.,
Implementation of integrity constraints and views by modification,
{\sl Proc. SIGMOD Conf.}, 1975, pp. 65-78.
[Stonebreaker75]

\reference
Sussman, G.,
{\sl A Computational Model of Skill Acquisition,}
American Elsevier, New York, 1975.
[Sussman75]

\reference
Suzuki, N.,
Automatic verification of programs with complex data structures,
AIM 279, February 1976.
[Suzuki76]

\reference
Tversky, A., and D. Kahneman,
Judgment under uncertainty:  Heuristics and biases,
{\sl Science}, vol. 185,  September 18 1974, pp. 1129-1131.
[Tversky74]

\reference
van Melle, W.,
Would you like advice on another horn,
{\sc MYCIN} project internal working paper,
Stanford University, Stanford, Calif., December 1974.
[van Melle74] 

\reference
Waldinger, R., and K. N. Levitt,
Reasoning about programs,
{\sl Artificial Intelligence}, vol. 5, Fall 1974, pp. 235-316.
[Waldinger74]

\reference
Waltz, D.,
Generating semantic descriptions from drawings of scenes with shadows,
AI-TR-271, MIT,  November 1972.
[Waltz72]

\reference
Warshall, S.,
A theorem on Boolean matrices,
{\sl JACM}, vol. 9, January 1962, pp. 11-12.
[Warshall62]

\reference
Waterman, D. A., Generalization learning techniques for automating the
learning of heuristics,
{\sl Artificial Intelligence}, vol. 1, 1970, pp. 121-170. 
[Waterman70]

\reference
Waterman, D. A.,
Exemplary programming, in D. Waterman and R. Hayes-Roth (Eds.),
{\sl Pattern-directed Inference Systems}, Academic Press, 1977.
[Waterman77]

\reference
Wickelgren, W. A.,
{\sl How to Solve Problems},
W. H. Freeman, San Francisco, 1974.
[Wickelgren74]

\reference
Winograd, T., {\sl Understanding Natural Language}, Academic Press, New York,
1972.
[Winograd72]

\reference
Winograd, T.,
Breaking the complexity barrier, again,
{\sl SIGPLAN Notices}, no. 1, January 1974.
[Winograd74]

\reference
Winograd, T.,  Frame representations and the procedural/declarative
controversy, in D. N. Bobrow and A. Collins (Eds.), {\sl Representation and
Understanding}, Aca\-de\-mic Press, New York, 1975. 
[Winograd75]

\reference
Winston, P. H.,
Learning structural descriptions from examples,
MAC TR-76, MIT, September 1970.
[Winston70]

\endrefs

\worldend